Approximation Algorithms : Set Cover and Max Cut 1 Unweighted Set
نویسنده
چکیده
منابع مشابه
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems
We investigate the approximability properties of several weighted problems, by comparing them with the respective unweighted problems. For an appropriate (and very general) definition of niceness, we show that if a nice weighted problem is hard to approximate within r, then its polynomially bounded weighted version is hard to approximate within r − o(1). Then we turn our attention to specific p...
متن کاملApproximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
Using ideas and results from polynomial approximation and exact computation we design approximation algorithms for several NP-hard combinatorial problems achieving ratios that cannot be achieved in polynomial time (unless a very unlikely complexity conjecture is confirmed) with worst-case complexity much lower (though super-polynomial) than that of an exact computation. We study in particular m...
متن کاملTo Weight or Not to Weight: Where is the Question?
We investigate the approximability properties of several weighted problems, by comparing them with the respective unweighted problems. For an appropriate (and very general) deenition of niceness, we show that if a nice weighted problem is hard to approximate within r, then its polynomially bounded weighted version is hard to approximate within r ? o(1). Then we turn our attention to speciic pro...
متن کاملImproved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
In this paper, we consider the minimum unweighted Vertex Cover problem with Hard Capacity constraints (VCHC) on multigraphs and hypergraphs. Given a graph, the objective of VCHC is to find a smallest multiset of vertices that cover all edges, under the constraints that each vertex can only cover a limited number of incident edges, and the number of available copies of each vertex is bounded. Th...
متن کاملFast Approximation Algorithms for Fractional Steiner Forest and Related Problems
We give a fully polynomial time approximation scheme (FPTAS) for the optimum fractional solution to the Steiner forest problem. This can easily be generalized to obtain an FPTAS for a hitting set problem on a collection of clutters. We also identify three other problems on collections of clutters and show how these four problems are related when the clutters have the max-flow min-cut (MFMC) pro...
متن کامل